integer factorization problemの例文

例文

もっと例文:   1  2

1. It is conjectured that the integer factorization problem is not self-reducible.
2. The integer factorization problem is the computational problem of determining the prime factorization of a given integer.
3. The work factor for breaking Diffie-Hellman is based on the discrete logarithm problem, which is related to the integer factorization problem on which RSA's strength is based.
4. Other notable examples include the travelling salesman problem, which asks for the route taken by the salesman, and the integer factorization problem, which asks for the list of factors.
5. If problem A is hard, there exists a formal security reduction from a problem which is widely considered unsolvable in polynomial time, such as integer factorization problem or discrete logarithm problem.